Parallel Partition Revisited
نویسندگان
چکیده
In this paper we consider parallel algorithms to partition an array with respect to a pivot. We focus on implementations for current widely available multi-core architectures. After reviewing existing algorithms, we propose a modification to obtain the minimal number of comparisons. We have implemented these algorithms and drawn an experimental comparison.
منابع مشابه
] 1 6 M ay 2 00 5 THE 3 D DIMER AND ISING PROBLEMS REVISITED
We express the finite 3D Dimer partition function as a linear combination of determinants of oriented adjacency matrices, and the finite 3D Ising partition sum as a linear combination of products over aperiodic closed walks. The methodology we use is embedding of cubic lattice on 2D surfaces of large genus.
متن کاملThe 3D Dimer and Ising problems revisited
We express the 3D Dimer partition function on a finite lattice as a linear combination of determinants of oriented adjacency matrices and the 3D Ising partition function as a linear combination of products over aperiodic closed walks. The methodology we use is embedding of cubic lattice on 2D surfaces of large genus. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملExploring Spatial Partition for Parallel Simulation of DEVS-FIRE
DEVS-FIRE is a cellular space model for simulating wildfire spread based on the DEVS formalism. To apply parallel simulation of the DEVS-FIRE model, we need a way to divide the simulation tasks and assign them to multiple parallel processing nodes. One way to divide the simulation tasks is based on the spatial partition of the cellular space model. Two spatial partition ideas, i.e., a uniform p...
متن کاملParallel Join Algorithms based on Parallel B+-trees
Within the last several years, a number of parallel algorithms for the join operation have been proposed. However, almost all of the algorithms did not take advantages of the underlying parallel storage structures or data declustering methods of the operand relations. This paper introduces the concept of parallel storage structure or declustering aware parallel join algorithm. A parallel B+-tre...
متن کاملThe Full Domain Partition Approach for Parallel Multigridon Adaptive
The combination of adaptive reenement, multigrid and parallel computing for solving partial diierential equations is considered. In the full domain partition each processor contains a partition of the grid plus the minimumnumber of additional coarse elements required to cover the whole domain. A parallel multigrid algorithm using the full domain partition is presented. The method obtains multig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008